Non - Wildcard Matching Beats
نویسنده
چکیده
Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation on this algorithm that has an improvement of about 4-10 in performance over the standard Interpretation Tree algorithm.
منابع مشابه
Hierarchical Matching Beats The Non-Wildcard and Interpretation Tree Model Matching Algorithms
In Fisher[l] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.
متن کاملHierarchical Matching Beats
In Fisherr1] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.
متن کاملNon-wildcard Matching Beats the Interpretation Tree
Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when being applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation o...
متن کاملPerformance Comparison of Ten Variations on the Interpretation-Tree Matching Algorithm
The best known algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines ten variations of this algorithm in a search for improved performance, and concludes that the non-wildcard and hierarchical algorithms have red...
متن کاملSpace-Efficient String Indexing for Wildcard Pattern Matching
In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses O(n log n) bits for any ε > 0 and reports all occ occurrences of a wildcard string in O(m + σ · μ(n) + occ) time, where μ(n) = o(log log logn), σ is the alphabet size, m is the number of alphabet symbols and g is the number of wildca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011